An Iterative Weighted Reliability Decoding Algorithm for Two-Step Majority-Logic Decodable Cyclic Codes
نویسندگان
چکیده
منابع مشابه
A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes
The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product code...
متن کاملIterative Threshold Decoding of Majority Logic Decodable Codes on Rayleigh Fading Channels
Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algo...
متن کاملOn a Class of One-Step Majority-Logic Decodable Cyclic Codes
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2 ) the decoding delay is short; and (3) its performance, while suboptimal, is always superior to bounded distance decoding. For these reasons, majoritylogic decodable cyclic codes are very suitable f o r error control in high speed digital data transmission systems. Among the majority-logic decodable co...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2013
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2013.082413.131191